def recursion(k,factors,b=2):
    if k%b == 0:
        factors.add(b)
        return recursion(k//b,factors,b)
    for i in range(k//b,b,-1):
        if k%i == 0:
            factor=k//i
            factors.add(factor)
            return recursion(i,factors,factor)
    if k != 1:
        factors.add(k)
    results=[ str(f) for f in sorted(factors) ]
    return ','.join(results)

def recurrence(k,factors,b=2):
    if k%b == 0:
        factors.add(b)
        return recurrence(k//b,factors,b)
    for i in range(b,k//b):
        if k%i == 0:
            factors.add(i)
            return recurrence(k//i,factors,i)
    if k != 1:
        factors.add(k)
    results=[ str(f) for f in sorted(factors) ]
    return ','.join(results)

# k=int(input())
# print(recursion(k,set()))
# print(recurrence(k,set()))
